Optimizing the Computational Lexicalization of Large Grammars
نویسنده
چکیده
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filtering during parsing. This problem is N P-comple te and untractable on large grammars. An approximation algorithm is presented. The quality of the suboptimal solution is evaluated on real-world grammars as well as on randomly generated ones.
منابع مشابه
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining gram...
متن کاملMultiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoini...
متن کاملUsing Lexicalized Grammars and Headedness for Approximate Plan Recognition
This paper presents a new algorithm for plan recognition using an action grammar formalism based on Combinatory Catagorial Grammar, that requires a significant shift in thinking about the problem of plan recognition. This approach makes significant use of the concepts of lexicalization and headedness from natural language parsing. It argues that lexicalization of action grammars can help plan r...
متن کاملStrong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining grammars cannot be transformed into a normal form (preserving the generated tree language), in which each production contains a lexical symbol. A more powerful model, the simple context-free tree grammar, admits such a norma...
متن کاملLexicalization of Probabilistic Grammars
Two general methods for the lexicalization of probabilistic grammars are presented which are modular, powerful and require only a small number of parameters. The rst method multiplies the unlexicalized parse tree probability with the exponential of the mutual information terms of all word-governor pairs in the parse. The second lexicalization method accounts for the dependencies between the dii...
متن کامل